#include<iostream>
#include<string>
#include<deque>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
#include"stack.h"
class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        bit::stack<int,list<int>> st;
        for (auto ch : tokens)
        {
            if (ch == "+" || ch == "-" || ch == "*" || ch == "/")
            {
                int right = st.top();
                st.pop();
                int left = st.top();
                st.pop();
                switch (ch[0])
                {
                case '+':
                    st.push(left + right);
                    break;
                case '-':
                    st.push(left - right);
                    break;
                case '*':
                    st.push(left * right);
                    break;
                case '/':
                    st.push(left / right);
                    break;
                }
            }
            else
            {
                st.push(stoi(ch));
            }
        }
        return st.top();
    }
};
void test_queue()
{
    bit::queue<int, list<int>> q;
    q.push(1);
    q.push(3);
    q.push(2);
    q.push(7);
    q.push(5);

    while (!q.empty())
    {
        cout << q.front() << " ";
        q.pop();
    }
    cout << endl;
}
int main()
{
	vector<string> arr = { "2","1","+","3","*" };
    test_queue();
	return 0;
}